Restricted Chase (Non)Termination for Existential Rules with Disjunctions
نویسندگان
چکیده
The restricted chase is a sound and complete algorithm for conjunctive query answering over ontologies of disjunctive existential rules. We develop acyclicity conditions to ensure its termination. Our criteria cannot always detect termination (the problem is undecidable), and we develop the first cyclicity criteria to show non-termination of the restricted chase. Experiments on real-world ontologies show that our acyclicity notions improve significantly over known criteria.
منابع مشابه
Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation
Existential rules have been proposed for representing ontological knowledge, specifically in the context of OntologyBased Data Access. Entailment with existential rules is undecidable. We focus in this paper on conditions that ensure the termination of a breadth-first forward chaining algorithm known as the chase. Several variants of the chase have been proposed. In the first part of this paper...
متن کاملTractable Query Answering for Expressive Ontologies and Existential Rules
The disjunctive skolem chase is a sound and complete (albeit non-terminating) algorithm that can be used to solve conjunctive query answering over DL ontologies and programs with disjunctive existential rules. Even though acyclicity notions can be used to ensure chase termination for a large subset of real-world knowledge bases, the complexity of reasoning over acyclic theories still remains hi...
متن کاملExtending Acyclicity Notions for Existential Rules (\emph{long version})
Existential rules have been proposed for representing on-tological knowledge, specifically in the context of Ontology-BasedQuery Answering. Entailment with existential rules is undecidable.We focus in this paper on conditions that ensure the terminationof a breadth-first forward chaining algorithm known as the chase.First, we propose a new tool that allows to extend existing...
متن کاملAcyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
Answering conjunctive queries (CQs) over a set of facts extended with existential rules is a prominent problem in knowledge representation and databases. This problem can be solved using the chase algorithm, which extends the given set of facts with fresh facts in order to satisfy the rules. If the chase terminates, then CQs can be evaluated directly in the resulting set of facts. The chase, ho...
متن کاملQuery Answering over Contextualized RDF/OWL Knowledge with Forall-Existential Bridge Rules: Decidable Finite Extension Classes (Post Print)
The proliferation of contextualized knowledge in the Semantic Web (SW) has led to the popularity of knowledge formats such as quads in the SW community. A quad is an extension of an RDF triple with contextual information of the triple. In this paper, we study the problem of query answering over quads augmented with forall-existential bridge rules that enable interoperability of reasoning betwee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017